Diffusive load-balancing policies for dynamic applications
نویسندگان
چکیده
منابع مشابه
Diffusive load-balancing policies for dynamic applications
Massively parallel architectures require decentralized and scalable system policies. The paper presents and evaluates a set of local dynamic load balancing strategies inspired by diffusion and characterized by different scopes of locality: the goal is to compare their performance depending on the application dynamicity. The paper shows that only slowly dynamic applications can take advantage of...
متن کاملOn the Effectiveness of Different Diffusive Load Balancing Policies in Dynamic Applications
The paper presents and evaluates a set of local dynamic load balancing strategies inspired to diffusion and characterised by different scopes of locality. The paper shows that policies with a very limited scope suit well highly dynamic applications; slowly dynamic applications, instead, can take advantage of diffusion policies with enlarged scope.
متن کاملDiffusive Algorithms for Dynamic Load Balancing in Massively Parallel Architectures
The paper investigates the area of dynamic load balancing with the specific target of massively parallel architectures. The lack of centralisation makes the architectures cost effective and scalable but requires suitable simple system policies without centralisation and with decisions based on a limited amount of information. The paper analyses the class of load balancing policies inspired to d...
متن کاملEngineering Diffusive Load Balancing Algorithms Using Experiments
We study a distributed load balancing problem on arbitrary graphs. First Order (FO) and Second Order (SO) schemes are popular local diiusive schedules for this problem. To use them, several parameters have to be chosen carefully. Determining the \optimal" parameters analytically is diicult, and on a practical level, despite the widespread use of these schemes, little is known on how relevant pa...
متن کاملDynamic Load Balancing Strategies for Graph Applications on GPUs
Acceleration of graph applications on GPUs has found large interest due to the ubiquitous use of graph processing in various domains. The inherent irregularity in graph applications leads to several challenges for parallelization. A key challenge, which we address in this paper, is that of loadimbalance. If the work-assignment to threads uses node-based graph partitioning, it can result in skew...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Concurrency
سال: 1999
ISSN: 1092-3063,1558-0849
DOI: 10.1109/4434.749133